Dissertation : Incremental Maintenance of Recursive Views with Applications to Tabled Logic Programming
نویسنده
چکیده
Vulnerability analysis using dynamic attack graphs, dynamic binary analysis for mobile code security, incre-mental bisimulation algorithm. Development of algorithms for incremental evaluation of tabled logic programs and its application to program analysis, generation and analysis of multiple counterexamples for error cause localization, model checking security-relevant properties of sequential programs, and rule based program analysis. Development of rule-based system for detection and analysis of vulnerabilities in Intelligent Firewall system. on verification of security protocols, and phishing (duration 5 months) Teaching Assistant.
منابع مشابه
Incremental Maintenance of Recursive Views with Applications to Tabled Logic Programming
Materialized views are used extensively in data warehousing for faster responses to user queries. These views have to be maintained in response to the changes in the base relations. In many cases, it is observed that the changes to the base relation have small effects on the materialized views. Thus instead of recomputing the materialized view from scratch, incremental computation of changes to...
متن کاملIncremental Evaluation of Tabled Logic Programs
Tabling has emerged as an important evaluation technique in logic programming. Currently, changes to a program (due to addition/deletion of rules/facts) after query evaluation compromise the completeness and soundness of the answers in the tables. This paper presents incremental algorithms for maintaining the freshness of tables upon addition or deletion of facts. Our algorithms improve on exis...
متن کاملA Local Algorithm for Incremental Evaluation of Tabled Logic Programs
This paper considers the problem of efficient incremental maintenance of memo tables in a tabled logic programming system when the underlying data are changed. Most existing techniques for incremental evaluation (or materialized view maintenance in deductive databases) consider insertion and deletion of facts as primitive changes, and treat update as deletion of the old version followed by inse...
متن کاملIncremental Maintenance Of Materialized XQuery Views by Maged F . El - Sayed A Dissertation Submitted
Keeping views fresh by maintaining the consistency between materialized views and their base data in the presence of base updates is a critical problem for many applications, including data warehousing and data integration. While heavily studied for traditional databases, the maintenance of XML views remains largely unexplored. Maintaining XML views is complex due to the richness of the XML dat...
متن کاملAchieving Scalability in Parallel Tabled Logic Programs
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming because it addresses some of most significant weaknesses of Prolog. Namely, it can guarantee termination for programs with the bounded term-size property. Tabled programs exhibit a more complex execution mechanism than trad...
متن کامل